Signal Processing Method

ABSTRACT

A demapping scheme, having a low computational cost, suitable for any transmission in which only exhaustive demapping can guarantee good performance. The scheme, proposed in this document, can be used in any transmission based on no differential modulation. For example the proposed scheme can be directly applied to a transmission on flat fading AWGN channels or to a transmission on frequency selective channels after equalization or on each sub-carrier of an OFDM System. The proposed solution can be applied for the demapping of any communication system. The proposed scheme can be used for rotated and un-rotated constellation.

REFERENCE DATA

This application claims priority of European patent application EP11158717 filed on 17 Mar. 2011, the contents whereof are hereby incorporated.

FIELD OF THE INVENTION

The present invention relates, in embodiments, to digital OFDM demodulators and processors, and to devices and methods to process digital OFDM signals like, but not exclusively, digital video broadcast signals.

RELATED ART

The new digital video broadcasting standard DVB-T2 includes the mandatory use of constellation rotation and cyclic Q delay (CRCQD) as a signal-space diversity technique.

After transmission on the channel by orthogonal frequency division multiplexing (OFDM), at the receiver the constellation does not exhibit the regular shape of QAM and in particular optimum demapping must be jointly performed on the real-imaginary axis for both hard and soft decoding. A joint demapping process requests a too high computational cost to be implemented in the receiver.

The new digital video broadcasting standard DVB-C2 includes the mandatory use of the 4096 QAM constellation. An exhaustive demapping process for a 4096QAM constellation has a too high computational cost to be implemented in the receiver.

The present invention relates to a demapping scheme, having a low computational cost, suitable for any transmission in which only exhaustive demapping can guarantee good performance. The proposed scheme can be used in any transmission based on no differential modulation. For example the proposed scheme can be directly applied to a transmission on flat fading AWGN channels or to a transmission on frequency selective channels after equalization or on each sub-carrier of an OFDM System. The proposed solution can be applied for the demapping of any communication system. The proposed scheme can be used for rotated and un-rotated constellation.

The method and system of the present invention are suitable for DVB-T2 and DVB-C2. Nevertheless, in the following, for the sake of simplicity only the T2 System, based on rotated constellation, will be taken into account. According to an aspect of the invention, only a subset of the constellation points close to the received samples is considered for demapping. Following another approach, the received sample is first scaled by the OFDM channel gain on the real and imaginary components, then counter-rotated and lastly a regular QAM demapper is applied. The proposed methods are compared with existing techniques both in terms of complexity and performance over reference DVB-T2 channels.

The publication “Frame structure channel coding and modulation for a second generation digital terrestrial television broadcasting system(DVB-T2), ETSI EN 302 755 V1.1.1, September 2009. The next generation of the digital video broadcasting standard for terrestrial transmissions” has introduced a number of new technological features, among which we mention new physical layer signalling, new tools for channel estimation and use of multiple antennas. Constellation rotation and cyclic Q delay (CRCQD) has been introduced in order to obtain signal-space diversity (SSD). SSD is implemented by CRCQD in two steps: 1) QAM symbols are rotated by a fixed angle and 2) the real and imaginary parts of each rotated symbol are transmitted on two different flat fading channels. The spectral efficiency is the same as for QAM transmission, since in step 2) two real and imaginary components belonging to different rotated QAM symbols can be combined for a transmission on a single complex channel.

The publication “Implementation guidelines for a second generation digital terrestrial television broadcasting system, dvb document a133, (draft tr. 102 831 v1.1.1), February 2009” describes how CRCQD improves performance especially when codes with high rates are used or when channel is subject to erasure phenomena. In this document each complex CRCQD symbol is transmitted on a different orthogonal frequency division multiplexing (OFDM) subcarrier. CRCQD has also been used in multiple input multiple output (MIMO) systems. More recently, combination of SSD with coded modulation systems has been investigated.

Due to the rotation and different allocation of real and imaginary components, the optimal decision regions for hard demapping do not have anymore the rectangular shape of QAM but they strongly depend on both the channel attenuations and rotation angle. Therefore, simple techniques used for hard and soft demapping of QAM symbols cannot be directly applied to CRCQD. Indeed, optimal performance for soft demapping are obtained by computing the distance of the received samples with respect to all the points of the constellation at the receiver input, with the two dimensional demapper (2D-DEM). However, for a large number of constellation points, i.e. using a 256 QAM as provided by DVB-T2, the complexity of the 2D-DEM has a significant impact on the receiver design, thus favoring the implementation of suboptimal demappers. For example a low complexity method based on the decomposition of the constellation into sub-regions corresponding approximately to each quadrant of the QAM constellation.

There is therefore a need for a process strategy to reduce the demapping computational cost.

BRIEF SUMMARY OF THE INVENTION

According to the invention, these aims are achieved by means of the object of the appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be better understood with the aid of the description of an embodiment given by way of example and illustrated by the figures, in which:

FIGS. 1 and 2 show in a schematic block fashion the demapping strategy according to an aspect of the invention.

FIG. 3 shows the optimal decision regions for a 2-dim demapper for a CRCQD 64-QAM constellation with a=10, b=2 and α=8.6 deg.

FIG. 4 illustrates the decision regions for a 1-dim demapper for a CRCQD 64-QAM constellation with a=10, b=2 and α=8.6 deg.

FIG. 5 shows, in graphical form, the average bit error rate (BER) as a function of a/b and a S/N ratio for a=b=1 of 20 db

DETAILED DESCRIPTION OF POSSIBLE EMBODIMENTS OF THE INVENTION

According to an aspect of the present invention, the demapping process can be performed in three tasks: represented by blocks B1, B2, B3 of FIG. 1

B1 Constellation Point Selection

According to an important aspect of the invention, this block selects, from the constellation, a subset of points that are close to the received sample, based on predefined criteria. The sub-set computation is based on two inputs: the sample of the received signal and the channel state information. Many techniques can be used to compute the constellation sub-sets. According to a preferred variant, B1 generates two sub-sets for every transmitted bit. The two sub-sets, associated to i-th transmitted bit, are denoted by S_(i) ⁽⁰⁾ and S_(i) ⁽¹⁾. S_(i) ⁽⁰⁾ is the set of the constellation points having an high probability of having been transmitted assuming the i-th transmitted bit equal to 0. Equivalently, S_(i) ⁽¹⁾ is the set of the constellation points having an high probability of having been transmitted assuming the i-th transmitted bit equal to 1. As mentioned above, the S_(i) ⁽⁰⁾ and S_(i) ⁽¹⁾ estimation is based on the received signal and on the channel state information. The techniques used for such computation can be suboptimal and then the computational cost can be significantly reduced. The cardinality of S_(i) ⁽⁰⁾ and S_(i) ⁽¹⁾ is function of these techniques used in B1. The higher is the approximation quality, the smaller the constellation sub-sets can be.

B2 Distance Computation:

This block computes the probability to receive one of the constellation points of S_(i) ⁽⁰⁾ and S_(i) ⁽¹⁾ given the received signal. Note that B2 computes this probability for all the points of S_(i) ⁽⁰⁾ and for all the points of S_(i) ⁽¹⁾. This probability can also be expressed in form of distance. In this case B2 computes the distance between the received signal and all the points in S_(i) ⁽⁰⁾ and S_(i) ⁽¹⁾. In this case the knowledge of the noise state information (σ_(n) ²) is not necessary. The B2 outputs are two sets of distances/probabilities. In the following, the two outputs will be denoted by L_(i) ⁽⁰⁾ and L_(i) ⁽¹⁾. L_(i) ⁽¹⁾ is the set of distances/probabilities of the received point respect all the constellation points of S_(i) ⁽⁰⁾. Equivalently, L_(i) ⁽¹⁾ is the set of distances/probabilities of the received point with respect to all the constellation points of S_(i) ⁽¹⁾.

B3 LLR Computation:

This block computes the Log-likelihood Ratio (LLR) for the i-th bit. The estimation is based one the two sets L_(i) ⁽¹⁾ and L_(i) ⁽⁰⁾ and it can take into account the noise state information. There are many techniques to compute the LLR, in the following we will present one of them, also known as minimum distance algorithm.

A first inventive aspect, denoted inverse demapping, reverses the effects of channel and mapping, obtaining a regular QAM constellation with the addition of noise whose real and imaginary components are correlated and have different variance. A second independent inventive aspect, denoted one-dimensional demapping, instead significantly reduces the number of points over which the distance is computed by first approximately identifying the region to which the received sample belongs with a simple dichotomic search on the real axis.

In the following sections we describe the system model for CRCQD; the new demappers; and their performance and complexity are in comparison with existing techniques.

Notation: j=√{square root over (−1)} and for a complex number x, x_(R) and x₁ denote its real and imaginary parts, respectively.

System Models

We consider a transmission where N_(b)=log₂M bits {b₁,b₂, . . . , b_(N) _(b) } are mapped on a M-QAM symbol s=s_(R)+js₁ taken from the set

C={x=β(x _(R) +jx ₁): x _(R) , x ₁=2c−√{square root over (M)}+1, c=0,1, . . . , √{square root over (M)}−1},   (1)

where β is an energy normalization factor (e.g. for 64-QAM β=1/√{square root over (42)}). For CRCQD the symbol is first rotated by an angle α to obtain

d=e^(jα)s   (2)

and then its real and imaginary parts are transmitted on two different subcarriers of an OFDM systems.

Let A≧0 and B≧0 the amplitudes of the channel on the two subcarriers where s has been transmitted. At the receiver, after OFDM demodulation, the phase rotation introduced by the channel on each subcarrier is compensated, so that the received signal turns out to be a scaled (by A and B) version of the transmitted signal, with the addition of noise. By collecting the real and imaginary part from the two OFDM carriers into the complex number r we have

$\begin{matrix} \begin{matrix} {r = {r_{R} + {j\; r_{I}}}} \\ {{= {{A\left\lbrack {{{\cos (\alpha)}s_{R}} - {{\sin (\alpha)}s_{I}}} \right\rbrack} + {j\; {B\left\lbrack {{{\sin (\alpha)}s_{R}} + {{\cos (\alpha)}s_{I}}} \right\rbrack}} + n}},} \end{matrix} & (3) \end{matrix}$

where n is the zero-mean circularly symmetric complex noise term and we assumed that all the carriers have the same noise power σ_(n) ². The constellation at the receiver input (relative to r) is defined by the set

C={ c=A[cos(α)x _(R)−sin(α)x ₁ ]+jB[sin(α)x _(R)+cos(α)x ₁ ]: x _(R) +jx ₁ ∈C}.   (4)

Log-Likelihood Computation

According to an aspect of the invention, the demappping is carried out based on the sample points of the sub-sets defined before, without using the points in the constellation not included in the sub-set. In order to perform soft-demapping we aim at computing the log-likelihood ratio (llr_(i)) of r, relative to each bit b_(i), i=1, 2, . . . , n_(b). The exact computation of the LLR requires the evaluation of the distance of r from all the points of the constellation C, i.e.

$\begin{matrix} {{{llr}_{i} = {\log \frac{\sum\limits_{\hat{s} \in {\overset{\_}{C}{({b_{i} = 1})}}}^{\;}\; ^{- \frac{{{r - \hat{s}}}^{2}}{2\; \sigma_{n}^{2}}}}{\sum\limits_{\hat{s} \in {\overset{\_}{C}{({b_{i} = 0})}}}^{\;}\; ^{- \frac{{{r - \hat{s}}}^{2}}{2\; \sigma_{n}^{2}}}}}},} & (5) \end{matrix}$

where C(b_(i)=k) is the subset of C containing all constellation points associated with b_(i)=k. 2D-DEM with exact LLR computation has a huge complexity, exponentially increasing with N_(b). An approach to reduce complexity consists in approximating the LLR with its suboptimal minimum distance (SUB-MIN-DIST) version, computed using only the shortest distance of r from points in the selected constellation subset corresponding to the values ‘0’ and ‘1’ of a bit, i.e. defining

ŝ_(i,k)=argmin_(s∈ C(b) _(i) _(=k)) {∥r−s∥ ²}.   (6)

and the normalized distances:

$\begin{matrix} {{{\mathcal{L}_{i}(0)} = \frac{{{r - {\hat{s}}_{i,0}}}^{2}}{2\; \sigma_{n}^{2}}},{{\mathcal{L}_{i}(1)} = \frac{{{r - {\hat{s}}_{i,1}}}^{2}}{2\; \sigma_{n}^{2}}},} & (7) \end{matrix}$

the llr can then be written as

llr_(i) ≈L _(i)(0)−L _(i)(1).   (8)

In this case, computing the llr boils down to the evaluation of the distance between r and the two closest points having the two values of bit i.

Two Dimension Demapper (2D-DEM)

While for QAM constellation the closest point is easily determined, for CRCQD the regions of points at minimum distance do not have a regular shape. For example, 64-QAM symbols with rotation coefficient α=8.6 deg transmitted on a channel with A=10 and B=2 yield the regions at minimum distance from the constellation points shown in FIG. 3. The points denoted with x define the constellation C. From this figure we note a rather irregular shape of the boundaries of the decision regions. In order to find the point at the minimum distance for CRCQD, we must compute the distance with respect to all the constellation points and then take the minimum, thus having a complexity similar to that of the exact LLR computation.

Low-Complexity Demappers

In this section we propose two methods for the approximate computation of the point at the minimum distance from r among those in the constellation subset C(b_(i)=k). Indeed we observe that the minimum distance points can be obtained by first identifying sub-sets S_(i)(0) and S_(i)(1) of the constellation points with the ith bit at 0 or 1 that are close to the receive sample. Then, distances are computed only within these sub-sets, i.e. the minimum distance point is now computed as

s _(i,k)=argmin_(s∈S) _(i) _((k)) {∥r−s∥ ²},   (9)

and the resulting architecture is shown in FIG. 2.

The sets S_(i)(k) can be determined off-line according to any criterion. For example, we can first determine the constellation point s at minimum distance from r and the we may have stored beforehand in a table the list of constellation points that are closest to s for a given value of the ith bit, for all values of i.

Note that the 2D-DEM still fits within this model by setting

S _(i)(0)= C (b ₁ =k) and S _(i)(1)= C (b _(i)=1).   (10)

One Dimension Demapper (1D-DEM)

Preferably, the criteria adopted by the constellation point selector of FIGS. 1 and 2 include comparing one component of the sample, either the real component or the imaginary component, according to the channel conditions, with a set of thresholds. This first low-complexity approach is denoted one dimension demapper (1D-DEM). The idea of 1D-DEM is to divide the constellation plan into sectors limited by parallel lines along the imaginary axis and then compute the distance of r only with respect to points within the two sector closest to r.

In the following, without loss of generality we consider the case A≧B, i.e. the channel provides a larger gain on the real axis than on the imaginary axis, as in the example of FIG. 3. For example, consider the problem of finding the closest point to r among all the constellation points of FIG. 3. In FIG. 4 the plane is split into sectors delimited by the vertical lines with real components m_(c), with c=1,2, . . . , μ. Then we first identify the sector boundary m closest to the received point r by comparing its real component with the {m_(c)} values and then we compute the distance with respect to the constellation points belonging to the two sectors adjacent to the found boundary. With reference to FIG. 4, if m=m₂ we compute the distance with respect to all the points having real component between m₁ and m₃. If m=m₅ we consider all the points with real component between m₄ and m₆, including the two points indicated with circles that do not belong to the same diagonal line of the other points. This procedure greatly reduces the number of computed distance since we have to compute at most √{square root over (M)} distances.

For the general case, we first indicate the ordered set of distinct values on the real axis of the QAM constellation points relative to b_(i)=k as V(b_(i)=k)={v₁, v₂, . . . , v_(μ(b) _(i) _(=k))}, where μ(b_(i)=k) indicates the set cardinality,

v _(c) <v _(c+1) , v _(c) =x _(R), with x ∈ C(b _(i) =k)   (11)

where C(b_(i)=k) is the subset of C containing all QAM constellation points associated with b_(i)=k, and c=1, 2, . . . , μ(b_i=k)−1. We then extend the set V(b_(i)=k) by including the real components of points in the middle of two boundary values in V(b_(i)=k), to obtain the ordered set M of size 2μ(b_(i)=k)−1 with elements

$\begin{matrix} {m_{c} = \left\{ \begin{matrix} \upsilon_{{({c + 1})}/2} & {{c = 1},3,\ldots \mspace{14mu},{{2\; {\mu \left( {b_{i} = k} \right)}} - 1},} \\ \frac{\upsilon_{c/2} + \upsilon_{{c/2} + 1}}{2} & {{c = 2},4,\ldots \mspace{14mu},{2{\left( {{\mu \left( {b_{i} = k} \right)} - 1} \right).}}} \end{matrix} \right.} & (12) \end{matrix}$

thus, the thresholds used in the sub-set selection are determined according to the condition and properties of the channel.

1D-DEM comprises two steps: a) we first establish the sector boundary and then b) we evaluate the distance of the points belonging to the two adjacent sectors. In particular, step a) is implemented as follows

q(b _(i) =k)=argmin_(c−1,2, . . . 2μ(b) _(i) _(−k)−1) {|r _(r) −m ₀ a cos(α)|²}.   (13)

note that the choice of the axis having the largest gain (as we suppose a>b) ensures the lowest error probability in the interval selection.

For points within the two adjacent sectors we compute the full distance with respect to r and then find the closest point to r. step b) is implemented as follows: when q(b_(i)=k) is odd we consider the constellation points

S _(i)(k)={a[cos(α)m _(q(b) _(i) _(=k))−sin(α)β(2c−√{square root over (m)}+1)]+j B[sin(α)m _(q(b) _(i) _(=k))+cos(α)β(2c−√{square root over (M)}+1)], c=2, . . . , √{square root over (M)}−2}∪{A|cos(α)m _(q(b) _(i) _(=k)+1)−sin(α)β(√{square root over (M)}−1)]+j B[sin(α)m _(q(b) _(i) _(=k)+1)+cos(α)β({square root over (M)}−1)], A[cos(α)m _(q(b) _(i) _(=k)−1)−sin(α)β(−√{square root over (M)}+1)]+j B[sin(α)m _(q(b) _(i) _(=k)−1)+cos(α)β(−{square root over (M)}+1)]},   (14a)

For q(b_(i)=k) even we consider the set

$\begin{matrix} {{S_{i}(k)} = {\left\{ {{{A\left\lbrack {{{\cos (\alpha)}m_{{q{({b_{i} = k})}} - 1}} - {{\sin (\alpha)}{\beta \left( {{2\; c} - \sqrt{M} + 1} \right)}}} \right\rbrack} + {j\; {B\left\lbrack {{{\sin (\alpha)}m_{{q{({b_{i} = k})}} - 1}} + {{\cos (\alpha)}{\beta \left( {{2\; c} - \sqrt{M} + 1} \right)}}} \right\rbrack}}},{c = 0},1,\ldots \mspace{14mu},{\frac{\sqrt{M}}{2} - 1}} \right\}\bigcup{\left\{ {{{A\left\lbrack {{{\cos (\alpha)}m_{{q{({b_{i} = k})}} + 1}} - {{\sin (\alpha)}{\beta \left( {{2\; c} - \sqrt{M} + 1} \right)}}} \right\rbrack} + {j\; {B\left\lbrack {{{\sin (\alpha)}m_{{q{({b_{i} = k})}} + 1}} + {{\cos (\alpha)}{\beta \left( {{2\; c} - \sqrt{M} + 1} \right)}}} \right\rbrack}}},{c = \frac{\sqrt{M}}{2}},{\frac{\sqrt{M}}{2} + 1},\ldots \mspace{14mu},{\sqrt{M} - 1}} \right\}.}}} & \left( {14b} \right) \end{matrix}$

Lastly, we find the closest point as

ŝ _(i,k)=argmin_(s∈S) _(i) _((k)) {∥r−s∥ ²}.   (15)

Inversion Demapper (IDEM)

The second reduced-complexity approach for the computation of the minimum distance point is the inversion demapper (IDEM), which reverses the scaling and/or distorsions on the QAM symbol introduced by both CRCQD and the channel. In particular we compute

$\begin{matrix} {r^{\prime} = {\left( {\frac{r_{R}}{A} + {j\frac{r_{I}}{B}}} \right)^{{- j}\; \alpha}}} & (16) \end{matrix}$

and then use a regular QAM constellation for detection, i.e.

ŝ _(i,k)=argmin_(s∈C(b) _(i) _(=k)) {∥r′−s∥ ²}.   (17)

In order to avoid divisions that require more sophisticated hardware, (16) and (17) can be also be rewritten as follows

r″=(Br _(R) +jAr _(I))c ^(−jα)  (18)

and then use a regular QAM constellation for detection, i.e.

ŝ _(i,k)=argmin_(s∈C(b) _(i) _(=k)) {∥r″−ABs∥ ²}.   (19)

In this case, the sets S_(i(k)) comprises only one element, that can be determined by a simple dichotomic search over the received sample, without the need of computing all distances.

Note that this approach is suboptimal since the distance of r with respect to the points of C(b_(i)=k) is not the same as the distance of r′ with respect to the points of C(b_(i)=k) and therefore in some cases ŝ_(i,k) computed with (17) may not coincide with the point obtained with the 2D-DEM.

Numerical Results

We have first evaluated the performance of the proposed demappers in terms of uncoded bit error rate (BER) on a channel with additive white Gaussian noise (AWGN) as a function of A/B, with B=1. Perfect channel knowledge is assumed and a 64-QAM with α=8.6 deg is considered. For an ideal channel the signal to noise ratio (SNR) is 20 dB. We also report the performance of a demapper that exploits only the strongest component of r and we denote it PAM demapper. For example, if A>B, the real part of r is considered and this approach may be suitable when an erasure of the imaginary axis occurs and demapping is performed as follows

ŝ _(i,k)=argmin_(s∈ C(b) _(i) _(=k)) ∥r _(R) −s _(R)∥²}.   (20)

FIG. 5 shows the BER for the various demappers. We note that the best performance is provided by 2D-DEM. IDEM has the same performance for small values of A, while 1D-DEM exhibits a constant gap with respect to 2D-DEM. Lastly, note that PAM-DEM always performs significantly worse than the other demappers, and therefore we conclude that it can be used only when an erasure occurs, when it becomes equivalent to 2D-DEM.

We also evaluated the performance of the considered demappers for a Rayleigh channel in a complete DVB-T2 system, including time, frequency and bit interleaving and low density parity check (LDPC) codes.

Tab. I shows the minimum required SNR to achieve a BER of 10⁻⁴ at the output of the LDPC decoder with a 16K code block length, for the CRCQD transmission based on the 16-QAM with α=16.8 deg and for various LDPC code rates. We observe that 1 D-DEM yields the same performance of the optimal 2D-DEM, while IDEM has a loss of 1÷2 dB with respect to 2D-DEM. Results for PAM-DEM are not reported as the required SNR is over 40 dB for all configuration, hence we conclude that PAM-DEM is not suited for DVB-T2.

TABLE I Required SNR to obtain BER = 10⁻⁴ at the output of the LDPC decoder Code Rate 2D-DEM IDEM 1D-DEM 1/2 7.6 8.7 7.6 3/5 10.3 11.8 10.3 2/3 11.7 13.3 11.8 3/4 13.2 15.4 13.4 4/5 14.5 16.7 14.6 5/6 15.4 17.9 15.6

TABLE II Complexity Comparison 256 QAM Scheme FD RM RS COMP FD RM RS COMP 2D-DEM M 2 + 3M 2M  M 256 770 512 256 DEM  M′  2 + 3M′ 2M′ M′ + 4 81 245 162 85 1D-DEM {square root over (M)} 4 + 2{square root over (M)} 2 + 2{square root over (M)} {square root over (M)} 16 36 34 16 IDEM 1 10  4 0 1 10 4 0 PAM-DEM 1 2 1 log₂ (M) 1 2 1 8

Complexity

We now consider in details the complexity of each demapper. The complexity of the various algorithms can be first evaluated by the number of points over which we evaluate the full distance (FD). Then, a more in-depth analysis is provided by the number of real multiplications (RM), real sums (RS) and comparisons (COMP) entangled by the various approaches. Many of the considered demappers perform a search over an equi-spaced set (DSES)—e.g. looking for the nearest integer to a real value—to find the minimum distance point. We observe that DSES entails only one multiplication (1 RM) as computational complexity.

2D-DEM: First note that we can divide r by A thus eliminating one parameter and considering only the parameter B/A (2 RM). Then we must compute all M points of the constellationĈ, requiring M RM (single parameter scaling). The distances with respect to all points (2M RM and 2M RS) are then computed and compared (M COMP). Therefore for the 2D-DEM we have M FD computations, as can be seen from (10).

1D-DEM We first find the region on the real axis solving a DSES problem (1 RM), then compute the coordinate on the rotated and stretched imaginary axis projection (4 RM, 2 RS). We compute the distance with respect to closest points (2√{square root over (M)} RM and 2√{square root over (M)} RS), which must then be compared (√{square root over (M)} COMP). Therefore 1D-DEM requires √{square root over (M)} FD computations as can be seen from (14).

IDEM In this case we first divide the real and imaginary part of r by A and B, respectively, and the invert the rotation the received point (6 RM, 2 RS), then demap a QAM with two DSESs problem (2 RM). Lastly, we compute the distance with the found point (2 RM and 2 RS). In this case we have 1 FD computation.

DEM First note that we can divide r by A thus eliminating a parameter and considering only B/A as parameter (2 RM). We then have to find the sub-region (4 COMP), M′=(√{square root over (M)}/2+1)² points per subregion. We compute M′ points of the constellation C, requiring M′ RM (single parameter scaling) and the distance with respect to all points (2M′ RM and 2M′ RS). Lastly, we compare the distances (M′ COMP). In this case we have M′ FD computations.

PAM demapper For the PAM demapper we divide the real part of r by A (1 RM), find the closest point among M values by a dichotomic search (log₂(M) COMP) and compute the distance (1 RS and 1 RM), thus requiring 1 FD computation.

Complexities of the various techniques are summarized in Tab. II, which also reports the required RM, RS and COMP for the specific case of a CRCQD 256-QAM constellation. From the table we note that 1D-DEM yields a significant reduction of complexity, requiring only 16 evaluation of distances instead of the 256 required by the 2D-DEM. The IDEM and PAM-DEM have the lowest complexity, however their performance is not satisfactory for DVB-T2 applications. Therefore, we conclude that 1 D-DEM provides the best trade-off as it significantly reduces complexity while having a negligible performance loss.

CONCLUSIONS

The present invention relates to a low-complexity method to process a OFDM signal and to the corresponding processing circuit. In particular, an aim of the present invention is to provide a soft CRCQD demappers that reduces the number of points considered for distance calculation. Both the complexity and the performance of the proposed approaches have been evaluated in a DVB-T2 scenario, showing the merits of the solutions over existing demappers. 

1-8. (canceled)
 12. A method of processing a signal received through a channel and modulated according to a modulation scheme that involves a constellation of symbols representing groups of bits, comprising the steps of: filtering and demodulating the signal; extracting a sample of the demodulated signal; splitting the constellation plane into sectors delimited by thresholds on the real component or on the imaginary component, identifying the sector boundary closest to the sample, identifying the sector boundary closest to the sample, selecting the subset of the constellation points belonging to the two sectors adjacent the identified sector boundary, compute the distances of the sample from the selected constellation points. demapping the sample based on the computed distances without using the points of the constellation not included in said subset.
 13. The method of claim 12 wherein said sectors are delimited by thresholds in the component providing the largest gain in the channel.
 14. The method of claim 12, wherein the selecting step extracts, form the constellation, for every bit in the sample of the demodulated signal, a first sub-set associated to i-th transmitted bit, of the constellation points having a high probability of having been transmitted assuming the i-th transmitted bit equal to 0, and a second sub-set associated to i-th transmitted bit, of the constellation points having an high probability of having been transmitted assuming the i-th transmitted bit equal to
 1. 15. The method of claim 12, including a step of determining said thresholds according to conditions of the channel.
 16. The method of claim 12, wherein the step of demapping includes computing log-likelihood ratios relative to the values of bits in the sample.
 17. The method of claim 12, wherein the step of demapping includes computing distances between the sample and only the points in the selected subset.
 18. The method of claim 17, wherein the step of demapping includes computing the shortest distance between the samples and points in the subset corresponding to the values ‘0’ and ‘1’ of a bit.
 19. The method of claim 1, wherein demapping includes the step of reverting scaling and/or distortion in the channel. 